MATH5705: Enumerative Combinatorics

4 Credits

Basic enumeration, bijections, inclusion-exclusion, recurrence relations, ordinary/exponential generating functions, partitions, Polya theory. Optional topics include trees, asymptotics, listing algorithms, rook theory, involutions, tableaux, permutation statistics. prereq: [2243 or 2373 or 2573], [2263 or 2283 or 2374 or 2574 or 3283]

View on University Catalog

All Instructors

B+ Average (3.189)Most Common: A (46%)

This total also includes data from semesters with unknown instructors.

39 students
SWFDCBA
  • 6.00

    /6

    Recommend
  • 5.69

    /6

    Effort
  • 5.94

    /6

    Understanding
  • 5.92

    /6

    Interesting
  • 5.88

    /6

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy